least-cost current
Attributed to the least-cost stream
Primal-Dual / Shortest Path Iterative Method
O(V^2UC) Spaghetti Source - Minimum Cost Flow (Primal-Dual)
O(FElogV) minimum cost flow | libalgo
O(FElogV) Minimum Cost Flow (Primal-Dual) | Luzhiled's memo
https://www.hamayanhamayan.com/entry/2017/05/09/120428
Spaghetti Source - Minimal-Dual (Primal-Dual)
Eliminate negative edges by using potentials, resulting in [Dijkstra method
Primal Dual
minimum cost flow | libalgo
Why Main Twins?
https://kopricky.github.io/code/NetworkFlow/min_cost_flow_memo.html
flow_bunkakai_memo.md · GitHub
http://hos.ac/slides/20150319_flow.pdf
developmental topic
http://sigma425.hatenablog.com/entry/2014/10/12/122018
http://tokoharuland.hateblo.jp/entry/2019/12/25/000000
Ant book p202
Implementation of others
https://ei1333.github.io/luzhiled/snippets/graph/primal-dual.html
---
This page is auto-translated from /nishio/最小費用流. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.